Countable admissible ordinals and hyperdegrees

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Countable Ordinals

This development defines a well-ordered type of countable ordinals. It includes notions of continuous and normal functions, recursively defined functions over ordinals, least fixed-points, and derivatives. Much of ordinal arithmetic is formalized, including exponentials and logarithms. The development concludes with formalizations of Cantor Normal Form and Veblen hierarchies over normal functions.

متن کامل

Images of the Countable Ordinals

We study spaces that are continuous images of the usual space [0, ω1) of countable ordinals. We begin by showing that if Y is such a space and is T3 then Y has a monotonically normal compactification, and is monotonically normal, locally compact and scattered. Examples show that regularity is needed in these results. We investigate when a regular continuous image of the countable ordinals must ...

متن کامل

Metarecursively Enumerable Sets and Admissible Ordinals

Here we describe some results which will be proved in detail in [13] and [l4]. The notion of metarecursive set was introduced in [8]. Kreisel [7] reported on some of the model-theoretic deliberations which preceded the definitions of [8]. Metarecursion theory is a generalization of ordinary recursion theory from the natural numbers to the recursive ordinals. Theorems about finite sets of natura...

متن کامل

Walks on Countable Ordinals and Selective Ultrafilters

In our previous work we have introduced filters on the set of countable ordinals as invariants to standard characteristics of walks in this domain. In this note we examine their projections to the set of natural numbers.

متن کامل

Countable Ordinals and the Analytical Hierarchy, I

Proof. For notational simplicity let us take n = 1 as a typical case. Thus let A C WO be ΣJ and assume sup {|a |: a E A} < Nj. Let B Qω be Π2 and /: ω ->ω recursive such that f[B] = A. Consider then the following game: Player I plays β, player II plays γ and II wins iff γ E WO&(β E B -> \f(β)| g | γ | ) . Clearly player II has a winning strategy in this game. But his payoff set is Σ\9 so by a r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 1976

ISSN: 0001-8708

DOI: 10.1016/0001-8708(76)90187-0